WALKING IN A TRIANGULATION

Walking Faster in a Triangulation

Point location in a triangulation is one of the most studied problems in computational geometry. For a single query, stochastic walk is a good practical strategy. In this work, we propose two approaches improving the performance of the stochastic walk. The first improvement is based on a relaxation of the exactness of the predicate, whereas the second is based on termination guessing. Key-words...

[inria-00344519, v1] Walking in a Triangulation

Internship proposal Walking in triangulation , probabilistic analysis

Geometric problems are central in many areas of science and engineering. Computational geometry, the study of combinatorial and algorithmic problems in a geometric setting, and in particular triangulations have tremendous practical applications in areas such as computer graphics, computer vision and imaging, scientific visualization, geographic information systems, astronomy, computational biol...

A Small Improvement in the Walking Algorithm for Point Location in a Triangulation

The paper shows a simple technique which saves some edge tests in the walking algorithm for point location. The walking technique does not achieve the logarithmic per point complexity of the location-datastructure-based methods but does not need any auxiliary data structure and is very simple to implement, therefore, it is very popular in practice. The suggested idea did not bring a substantial...

Zig-zagging in a Triangulation

Let T = (V, F,E) be a 2-dimensional triangular tiling of R 2 in quad-edge representation [2], consisting of a set of vertices V , a set of faces F and a set of half-edges E. We say T is locally finite iff for any circle in R 2 it holds that the set consisting of all edges (vertices, faces) in T that intersect the circle (circumference or interior) is finite. Let e ∈ E be some half-edge of this ...